package com.java.comprehensive.arithmetic.leecode.easy;

import util.TreeNode;

/**
 * @Author: 窦绍飞
 * @Date: 2022/6/14
 */
public class LeetCode_226 {
	public static TreeNode invertTree(TreeNode root) {
		if (root == null) {
			return null;
		}
		TreeNode left = invertTree(root.left);
		root.left = invertTree(root.right);
		root.right = left;
		return root;
	}

	public static void main(String[] args) {

	}
}
